Admissible and Restrained Revision
نویسندگان
چکیده
منابع مشابه
Admissible and Restrained Revision
As partial justification of their framework for iterated belief revision Darwiche and Pearl convincingly argued against Boutilier’s natural revision and provided a prototypical revision operator that fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. Admissible revision ensures that ...
متن کاملRestrained Revision
As part of the justification of their proposed framework for iterated belief revision Darwiche and Pearl advanced a convincing argument against Boutilier’s natural revision, and provided a prototypical revision operator which fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. These a...
متن کاملself-revision and third party revision in translation
اهمیت این پژوهش در آن بود که به گفت? بسیاری از پژوهشگرانِ حوز? بازبینی ترجمه، ادبیات موجود در این زمینه به لحاظ نظری و عملی چندان قوی نیست و بخش های موجود نیز برداشت مناسبی از این مرحل? فرایند ترجمه ندارند، اگرچه اخیراً توجه به آن به صورت نظام مند افزایش یافته است. در عین حال، پژوهش های موجود از یک سو بر دگربازبینی بیشتر از خودبازبینی تأکید دارند و از دیگر سو تنها به لحاظ نظری به این موضوع می پرد...
15 صفحه اولTrees with Equal Restrained Domination and Total Restrained Domination Numbers
For a graph G = (V,E), a set D ⊆ V (G) is a total restrained dominating set if it is a dominating set and both 〈D〉 and 〈V (G)−D〉 do not have isolated vertices. The cardinality of a minimum total restrained dominating set in G is the total restrained domination number. A set D ⊆ V (G) is a restrained dominating set if it is a dominating set and 〈V (G) − D〉 does not contain an isolated vertex. Th...
متن کاملAdmissible Proof Theory And
1 Prologue Ordinals made their entrance in proof theory through Gentzen's second consistency proof for Peano Arithmetic by transsnite induction up to " 0 , the latter being applied only to decidable predicates (cf. Gentzen 1938]). Gentzen's constructive use of ordinals as a method of analyzing formal theories has come to be a paradigm for much of proof theory from then on, particularly as exemp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2006
ISSN: 1076-9757
DOI: 10.1613/jair.1874